Controllable and decomposable multidirectional synchronizations
نویسندگان
چکیده
منابع مشابه
Application-Oriented Synchronizations
In this paper we introduce a formalism which allows to address the speciication of application-oriented synchronizations. The idea behind using synchro-nizations is to force explicit dependences in such a way that the return value for each read operation is more predictable. By using those operations at the application level, programmers are able to obtain ee-cient algorithms for speciic applic...
متن کاملAutomatic Synthesis of Sequential Synchronizations
To compose sequential systems, designers usually have to devise a synchronization mechanism which coordinates constituents of the composition in order to achieve certain goals of computation. In this paper, we present a simple language for specifying sequential behaviors. An advantage of the language is that a speci cation of synchronization, when composition is required, can be easily obtained...
متن کاملConcurrent and Located Synchronizations in pi-Calculus
We present two novel semantics for π-calculus. The first allows one to observe on which channel a synchronization is performed, while the second allows concurrent actions, provided that they do not compete for resources. We present both a reduction and a labeled semantics, and show that they induce the same behavioral equivalence. As our main result we show that bisimilarity is a congruence for...
متن کاملMultidirectional Information
—In this paper a region-adaptive demosaicking algorithm with low computational complexity for single-sensor digital cameras is proposed. The proposed algorithm firstly divides the input image into two kinds of regions and then adopts different interpolation methods for each type. The proposed interpolation method makes full use of bilinear’s fast execution speeds in the smooth region. And it d...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software and Systems Modeling
سال: 2021
ISSN: 1619-1366,1619-1374
DOI: 10.1007/s10270-021-00879-w